A Note on Proofs of the Pigeonhole Principle in Deep Inference

نویسنده

  • ANUPAM DAS
چکیده

It is known that the functional and onto variants of the propositional pigeonhole principle have polynomial-size proofs in the weakest deep inference systems. The unrestricted variant has quasipolynomial-size proofs when dag-like behaviour is permitted. Here we match that upper bound in systems free of dagness, and indeed other compression mechanisms, utilising a similar strategy to that of Atserias, Galesi and Gavalda for the monotone sequent calculus. Preliminaries. We assume general familiarity with deep inference. As introductory material consult [BG09] and [Das12b] for known results on the complexity of deep inference, [Jeř09] for the relationship between deep inference and the monotone sequent calculus, [AGG00] for monotone sequent proofs of the pigeonhole principle and basic properties of threshold formulae, and [GG08] for an introduction to streamlining and atomic flows. The proofs we ultimately obtain are free of compression mechanisms, or uncompressed, in the sense of [Das12a]. All proofs considered are monotone, i.e. there is no use of the negation rules, unless mentioned otherwise. Systems are construed with constants ⊥,> in the standard way, and we use the notation KS to denote the system KS∪ {aw↑, ac↑}. Bold lowercase letters a, b, . . . are used to denote vectors of propositional variables and bold uppercase letters A,B, . . . are used to denote matrices of propositional variables. Threshold formulae and permutations. Threshold formulae assert that at least k out of n inputs are true. Logically, the truth of these formulae is preserved under permutation of the inputs, but it is not an easy task to provide propositional proofs of this fact in the absence of dag-like behaviour, provided in deep inference by the presence of contraction loops. In this section we show that derivations with sequences of contraction loops of length log n can be constructed for certain permutations: interleavings and thereby switching of rows and columns. This ensures that, when eliminating these loops, the derivations only blow up quasipolynomially. Remark 1. Throughout, we will assume that m,n are powers of 2 and m ≤ n. Definition 2 (Threshold formulae). We define monotone divide-and-conquer threshold formulae inductively as follows: THk(a) ≡  > k = 0 a k = 1 ⊥ k > 1 , TH k (a, b) ≡ ∨ i+j=k THi (a) ∧ TH n j (b) Observation 3. THk (a) has size n n) and depth O(log n). Date: June 4, 2012. 1

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The pigeonhole principle and related counting arguments in weak monotone systems

We construct quasipolynomial-size proofs of the propositional pigeonhole principle for the fragment of the sequent calculus with no cuts between ancestors of left and right negation, weakening and contraction rules. The main construction of our argument, inspired by previous work on the monotone calculus by Atserias et al., provides formal proofs that permute the inputs of formulae computing th...

متن کامل

Applications of positive and intuitionistic bounded arithmetic to proof complexity

We introduce uniform versions of monotone and deep inference proof systems in the setting of bounded arithmetic, relating the size of propositional proofs to forms of proof-theoretic strength in weak fragments of arithmetic. This continues the recent program of studying the complexity of propositional deep inference. In particular this work is inspired by previous work where proofs of the propo...

متن کامل

Some Results on the Relative Proof Complexity of Deep Inference via Atomic Flows

Abstract. We consider the proof complexity of the minimal complete fragment of standard deep inference, denoted KS. To examine the size of proofs we employ atomic flows, diagrams that trace structural changes through a proof but ignore logical information. As results we obtain a polynomial simulation of dag-like cut-free Gentzen and Resolution, along with some extensions. We also show that thes...

متن کامل

On the relative proof complexity of deep inference via atomic flows

Abstract. We consider the proof complexity of the minimal complete fragment, KS, of standard deep inference systems for propositional logic. To examine the size of proofs we employ atomic flows, diagrams that trace structural changes through a proof but ignore logical information. As results we obtain a polynomial simulation of versions of Resolution, along with some extensions. We also show th...

متن کامل

On the relative proof complexity of deep inference via atomic flows

Abstract. We consider the proof complexity of the minimal complete fragment, KS, of standard deep inference systems for propositional logic. To examine the size of proofs we employ atomic flows, diagrams that trace structural changes through a proof but ignore logical information. As results we obtain a polynomial simulation of versions of Resolution, along with some extensions. We also show th...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2012